On the Complexity of Some Geometric Problems With Fixed Parameters
نویسندگان
چکیده
منابع مشابه
Complexity of Some Geometric Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on the rectilinear crossing number and intersection graphs of line segments, we argue that there is a need to recognize this level of complexity as its own class.
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولOn the Complexity of Some Geometric Problems in Unbounded Dimension
This paper examines the complexity of several geometric problems due to un bounded dimension The problems considered are i minimum cover of points by unit cubes ii minimum cover of points by unit balls and iii minimum number of lines to hit a set of balls Each of these problems is proven not to have a poly nomial approximation scheme unless P NP Speci c lower bounds on the error ratios attainab...
متن کاملOn the Complexity of Some Common Geometric Location Problems
Given n demand points in the plane, the p-center problem is to find p supply points (anywhere in the plane) so as to minimize the maximum distance from a demo& point to its respective nearest supply point. The p-median problem is to minimize the sum of distances from demand points to their respective nearest supply points. We prove that the p-center and the p-media problems relative to both the...
متن کاملComplexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on the rectilinear crossing number and intersection graphs of line segments, we argue that there is a need to recognize this level of complexity as its own class.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2021
ISSN: 1526-1719
DOI: 10.7155/jgaa.00557